From qd to LR, or, how were the qd and LR algorithms discovered?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From qd to LR, or, How were the qd and LR algorithms discovered?

Perhaps the most astonishing idea in eigenvalue computation is Rutishauser’s idea of applying the LR transform to a matrix for generating a sequence of similar matrices that become more and more triangular. The same idea is the foundation of the ubiquitous QR algorithm. It is well known that this idea originated in Rutishauser’s qd algorithm, which precedes the LR algorithm and can be understoo...

متن کامل

Generalised LR parsing algorithms

This thesis concerns the parsing of context-free grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any context-free grammar is called a generalised (contextfree) parser. This thesis is devoted to the theoretical analysis ...

متن کامل

III-Nitride QD Lasers

III-Nitrides QD lasers are studied in detail. Two types of QD structures are considered, GaN/AlxGa1-xN/AlN and InxGa1-xN/ In0.04Ga0.96N /GaN. Effects of: QD size; QD and WL composition; and doping are studied through the calculations of gain, threshold current, and intensity modulation bandwidth. It is shown that GaN QDs are less sensitive to size fluctuations. Bandwidth increases with doping a...

متن کامل

Quasi-derivations and QD-algebroids

Axioms of Lie algebroid are discussed. In particular, it is shown that a Lie QD-algebroid (i.e. a Lie algebra bracket on the C∞(M)-module E of sections of a vector bundle E over a manifold M which satisfies [X, fY ] = f [X, Y ] + A(X,f)Y for all X, Y ∈ E , f ∈ C∞(M), and for certain A(X,f) ∈ C∞(M)) is a Lie algebroid if rank(E) > 1, and is a local Lie algebra in the sense of Kirillov if E is a ...

متن کامل

A Multivariate Qd-like Algorithm

The problem of constructing a univariate rational interpolant or Pad~ approximant for given data can be solved in various equivMent ways: one can compute the explicit solution of the system of interpolation or approximation conditions, or one can start a recursive algorithm, or one can obtain the rational function as the convergent of an interpolating or corresponding continued fraction. In eas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IMA Journal of Numerical Analysis

سال: 2010

ISSN: 0272-4979,1464-3642

DOI: 10.1093/imanum/drq003